Enqvist, Kahl: Two View Geometry Estimation with Outliers
نویسندگان
چکیده
We study the relative orientation problem for two calibrated cameras with outliers from the feature matching. In recent years there has been a growing interest in optimal algorithms for computer vision. Most people agree that to get accurate solutions to multiview geometry problems, an appropriate norm of the reprojection errors should be minimized. To this end local as well as global optimization methods have been employed. To handle outliers though, heuristic methods still dominate the field. In this paper we address the problem of estimating relative orientation from uncertain feature correspondences. We formulate this task as an optimization problem and propose a branchand-bound algorithm to find the optimal set of correspondences as well as the optimal relative orientation. The approach is based on geometric constraints for pairs of correspondences. The experimental results are promising, especially for omnidirectional cameras. An implementation of the algorithm is also made publicly available to facilitate further research.
منابع مشابه
Two View Geometry Estimation with Outliers
Estimating the relative orientation of two cameras is a classical problem in vision. Probably the most well-known method is the eight-point algorithm introduced by Longuet-Higgins in 1981 [5], and modified by Hartley [3] to include normalization. Although normalization made the algorithm more robust, there are still algorithmic degeneracies and the algorithm breaks down in the presence of outli...
متن کاملRobust Optimal Pose Estimation
We study the problem of estimating the position and orientation of a calibrated camera from an image of a known scene. A common problem in camera pose estimation is the existence of false correspondences between image features and modeled 3D points. Existing techniques such as ransac to handle outliers have no guarantee of optimality. In contrast, we work with a natural extension of the L∞ norm...
متن کاملRobust Fitting for Multiple View Geometry
How hard are geometric vision problems with outliers? We show that for most fitting problems, a solution that minimizes the number of outliers can be found with an algorithm that has polynomial timecomplexity in the number of points (independent of the rate of outliers). Further, and perhaps more interestingly, other cost functions such as the truncated L2-norm can also be handled within the sa...
متن کاملEfficient algorithms for robust estimation of relative translation
One of the key challenges for structure from motion systems in order to make them robust to failure is the ability to handle outliers among the correspondences. In this paper we present two new algorithms that find the optimal solution in the presence of outliers when the camera undergoes a pure translation. The first algorithm has polynomial-time computational complexity, independently of the ...
متن کاملCorrespondence Problems in Geometric Vision
We study the problem of estimating the position and orientation of a calibrated camera from an image of a known scene. A common problem in camera pose estimation is the existence of false correspondences between image features and modeled 3D points. Existing techniques such as RANSAC to handle outliers have no guarantee of optimality. In contrast, we work with a natural extension of the L∞ norm...
متن کامل